Formal Tools for Describing and Processing Discontinuous Constituency Structure

نویسنده

  • Harry Bunt
چکیده

This contribution is concerned with the development of formal tools for the description and processing of discontinuous constituency structures. It is argued rst that the traditional tree representations of constituent structure are too limited, and that these representations in general should be allowed to have crossing branches. A precise mathematical deenition of discontinuous trees is provided, plus a linear precedence relation for expressing a kind of concatenation operation on these structures. The formal concepts introduced here are theory-neutral and can be applied in a wide variety of grammatical frameworks and their computer implementations. Their use in phrase-structure grammars is explained in some detail, developing a grammatical formalism called Discontinuous Phrase Structure Grammar (DPSG); their possible use in Categorial Grammar is considered very brieey. The paper concludes with a section on computational issues, in particular in relation to the computer implementation of DPSG for parsing and generation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A logical treatment of semi-free word order and bounded discontinuous constituency

In this paper we present a logical treatment of semi-free word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single formalism with a rigorous semantics without phrase structure rules. The elimination of phrase structure rules allows a natural generalisation of the approach to nonconfigurational word order and bounded discontinuous...

متن کامل

تبدیل خودکار درخت‌بانک وابستگی فارسی به درخت‌بانک سازه‌ای

There are two major types of treebanks: dependency-based and constituency-based. Both of them have applications in natural language processing and computational linguistics. Several dependency treebanks have been developed for Persian. However, there is no available big size constituency treebank for this language. In this paper, we aim to propose an algorithm for automatic conversion of a depe...

متن کامل

Mixed Qualitative/Quantitative Dynamic Simulation of Processing Systems

In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the multivariate statistics of principal component analysis (PCA), along with clustered fuzzy digraphs and reasoning. The PCA and fuz...

متن کامل

Neural Discontinuous Constituency Parsing

One of the most pressing issues in discontinuous constituency transition-based parsing is that the relevant information for parsing decisions could be located in any part of the stack or the buffer. In this paper, we propose a solution to this problem by replacing the structured perceptron model with a recursive neural model that computes a global representation of the configuration, therefore ...

متن کامل

A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles

The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument structure of the propositional content of text. Recent statistical approaches to automated predicateargument annotation have utilized parse tree paths as predictive features, which encode the path between a verb predicate a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996